Method for transmitting optimally diversified information in a MIMO telecommunication system

ABSTRACT

The present invention relates to a method for transmitting data between a transmitter TR and a receiver REC via communication channels CHNL. The method according to the invention further includes a symbol spreading step in the course of which a tunable integer number K of successive symbols Z1 . . . ZK are to be spread over several time chips before being transmitted, said tunable number K being adjusted with respect to physical properties of the communication channels CHNL. The data transmitted at any given moment will thus not be representative of a single symbol Zi, as is the case in known MIMO systems, but will represent a mixture between K successive symbols, which introduces data diversity with respect to time as perceived at the receiver end, and enables a tuning of the communication throughput between the transmitter TR and the receiver REC.

The present invention relates to a method for transmitting data in a telecommunication system including at least one transmitter provided with at least two transmitting antennas and at least one receiver provided with at least one receiving antenna, which method includes a symbol encoding step for producing symbols to be transmitted over communication channels established between the transmitting and receiving antennas.

Telecommunication systems in which a plurality of antennas are used at a receiver end and/or at a transmitter end of a wireless link are called Multiple Input Multiple Output systems (further referred to as MIMO systems). MIMO systems have been shown to offer large transmission capacities compared to those offered by single antenna systems. In particular, MIMO capacity increases linearly with the number of transmitting or receiving antennas, whichever the smallest, for a given Signal-to-Noise Ratio and under favourable uncorrelated channel conditions. MIMO techniques are thus likely to be used in future wireless systems intended to provide large spectral efficiencies or, alternatively, reduce the transmitting power required for obtaining a spectral efficiency equivalent to that which is obtained in current telecommunication systems. Such MIMO techniques will very likely be combined with multi-carrier modulation techniques like OFDM (standing for Orthogonal Frequency Division Multiplex) and MC-CDMA (standing for MultiCarrier-Code Division Multiple Access) techniques, whose use in future wireless systems is also considered.

A particular type of MIMO systems makes use of a Bit Interleaved Coded Modulation technique, further referred to as BICM, according to which the transmitter includes a channel encoder intended to apply an encoding, e.g. by means of a convolutional code or of a turbo code, to uncoded data bits, and to provide a binary stream to an interleaver. This interleaver will then deliver permutated bits, which are to be divided into word sequences intended to be transformed into a series of coded symbols featuring each a plurality of real or complex components, the components of a same symbol being intended to be transmitted during a same time chip by respective transmitting antennas. It should be noted here that information corresponding to two different time chips may be transmitted at two different instants in time, but may also be transmitted at a same instant by two different carrying signals having suitable different frequencies, for example in the purpose of spreading said symbols in the spectral domain, as may be done in OFDM telecommunication systems.

Transmitted symbols are to be decoded on the receiver end, which may be performed in MIMO systems of the BICM type by means of an iterative space-time decoder, which decoder is intended to produce estimates of coded bits constituting the transmitted symbols. The spatial diversity induced by the use of multiple transmitting and receiving antennas eases such a decoding, since this diversity provides a larger amount of information than that which would be provided by a single signal transmitted through a single communication channel.

The inventors have observed that increasing the diversity of input data perceived by a front-end detector included in a space-time decoder enables said decoder to converge more quickly towards reliable estimates of the coded bits on the basis of which said data has been generated. This may be construed as obtaining better decoding performance by feeding the decoder with data having a higher quality, i.e. a richer content.

The spatial diversity perceived by the receiving antennas, which is obtained by using multiple communication channels, though producing the above-mentioned advantages, is limited by the number of receiving antennas, which in turn limits the performance of the space-time decoder.

The inventors have also observed that, while the use of multiple transmitting and/or receiving antennas enables to transmit a larger amount of information, and thus to increase the throughput of the telecommunication system, said throughput should take into account adverse communication conditions affecting the communication channels established between any given transmitter and receiver. Such adverse conditions could cause transmitted data to be altered during its transmission in such a way that said data could not be safely retrieved by the receiver, in which case a certain degree of redundancy should preferably be introduced between the symbol encoding step and the actual transmission of the symbols.

The invention aims at solving the aforementioned problems, by providing a method for transmitting data in a MIMO system, which method involves an encoding scheme enabling to provide a high data diversity, with respect to both space and time, as perceived by at least one receiving antenna at the receiver end of such a telecommunication system, said method further providing an additional degree of freedom for adjusting the data throughput between any given transmitter and receiver, in order to allow a tuning of said throughput, which tuning will preferably be performed with respect to communication conditions between said transmitter and receiver.

Indeed, a method according to the opening paragraph is characterized according to the invention in that it further includes a symbol spreading step in the course of which a tunable integer number K of successive symbols are to be spread over several time chips before being transmitted over said communication channels, said tunable number K being adjusted with respect to physical properties of the communication channels.

The invention enables to compound the spatial diversity obtained by the use of multiple communication channels established between the transmitting and receiving antennas with a diversity with respect to time of the data perceived by the receiving antennas. The choice, offered by virtue of the invention, of the value of the number K of successive symbols to be spread over several time chips enables a tuning of the communication throughput between the transmitter and the receiver.

According to an advantageous embodiment of the invention, the tunable integer number K of successive symbols to be spread over several time chips is dynamically adjusted by the transmitter on the basis of feedback information sent by the receiver and representative of the quality of communication conditions between said transmitter and receiver.

The feedback information may consist in a signal-to-noise ratio or in a signal-to-interference ratio computed in real time by the receiver, but it may also be formed by a value computed for the tunable integer number K by the receiver as a function of such signal-to-noise or signal-to-interference ratios.

According to a possible embodiment of the invention, the symbol spreading step is performed by computing a plurality of linear combinations of said K successive symbols, which linear combinations are intended to be transmitted by means of the transmitting antennas over a predetermined number of time chips.

The data transmitted over the multiple communication channels at any given moment will thus not be representative of a single symbol, as is the case in most known MIMO systems, but will represent a mixture between successive symbols, which thus introduces diversity with respect to time, a possible data redundancy intended to offset difficult communication conditions being provided by the adjustement of the tunable number K allowed by virtue of the invention.

According to a specific embodiment of the invention, the symbol spreading step is performed by multiplying a vector formed by a concatenation of said K successive symbols, on the one hand, with a predefined spreading matrix, on the other hand.

This specific embodiment of the invention is quite easy to implement, and thus enables to obtain an increased diversity at a relatively low cost in terms of computing resources and processing power required at the transmitting end, which is an important issue in the field of mobile communications where the transmitter may be constituted by a mobile terminal such as a mobile phone, which has to be as small as possible and will be power-fed by a battery having a limited energy storage capacity.

In case of a difference between the size of the vector formed by a concatenation of said K successive symbols, on the one hand, and a number of columns of the spreading matrix, on the other hand, i.e. when the tunable integer K is chosen such that data redundancy will actually be obtained, the vector formed by a concatenation of said K successive symbols may be completed with a number of nil components equal to said difference in order to perform the above described matrix multiplication.

Alternatively, one dimension of the spreading matrix may be reduced by suppressing a number of colums or raws equal to said difference in order to perform said multiplication.

The nature of the predefined spreading matrix may be chosen on the basis of prior knowledge of, or on the basis of assumptions pertaining to the communication channels to be established between the transmitting and receiving antennas.

According to a first variant of the specific embodiment described above, the spreading matrix is constructed in such a way that each of its rows is formed by successive chunks having each a size corresponding to the number of transmitting antennas, all chunks of any given row forming respective vectors having all a same norm.

A spreading matrix according to this first variant enables an essentially homogeneous distribution over time of energy carried by the symbols transmitted through ergodic communication channels and ensures optimal detectability of changes in the communication conditions from one time chip to another. This in turn enables to provide a high diversity with respect to time and space of the data as perceived by receiving antennas at the receiver end of such ergodic communication channels.

According to a second variant of the specific embodiment described above, the spreading matrix is constructed in such a way that each of its rows is formed by successive chunks having each a size corresponding to the number of transmitting antennas, all chunks of any given row forming respective vectors having all a same norm and being orthogonal to each other.

Thanks to the orthogonality between chunks, a spreading matrix according to this second variant enables to add ergodicity to essentially invariant channels, during the time and/or frequency interval needed for transmitting the linear combinations of the tunable integer number K of successive symbols, and additionnally provides an essentially homogeneous distribution over this time and/or frequency interval of the energy carried by the symbols transmitted through said communication channels, which ensures optimal detectability of changes in the communication conditions from one time chip to another. This in turn enables to provide a high diversity with respect to time and space of the data as perceived by receiving antennas at the receiver end of such essentially invariant communication channels.

According to a third variant of the specific embodiment described above, the spreading matrix is constructed in such a way that each of its rows is constituted by a plurality of segments forming respective vectors having all a same norm, each segment including successive chunks having each a size corresponding to the number of transmitting antennas, all chunks of any given segment forming respective vectors having all a same norm and being orthogonal to each other.

A spreading matrix according to this third variant is particularly well-suited to so-called block-fading communication channels, which are expected to feature C successive sets of communication conditions over the whole duration of the transmission of a predetermined number S of successive symbols, each set of communication conditions of said block-fading channels being thus essentially invariant during S/C time chips.

The orthogonality between all chunks of a same segment enables to add ergodicity to the block-fading channels during each invariance period defined by these S/C time chips, the equality of the norms of said chunks additionnally providing an essentially homogeneous distribution over each invariance period of the energy carried by the symbols transmitted during said invariance period through the block-fading channels. Since the communication conditions within such block-fading channels change from one invariance period to another, block-fading channels may be considered ergodic at the scale of the invariance periods, so that the additional equality of the norms of the segments of each row of the spreading matrix is sufficient to ensure an essentially homogeneous distribution over all successive invariance periods of the energy carried by the symbols transmitted through the block-fading channels. This in turn enables to provide a high diversity with respect to time and space of the data as perceived by receiving antennas at the receiver end of such block-fading communication channels.

According to a preferred embodiment of the above-described first, second or third variants, the spreading matrix will additionally have the properties of a rotation matrix, i.e. such a spreading matrix will be constituted by rows orthogonal to each other and having a same norm.

The use of a rotation matrix for computing the plurality of linear combinations of successive symbols at the transmitter end enables to optimize global performance of the iterative space-time decoder intended to process said symbols at the receiver end, by enhancing the performance of the first iterative step performed by said decoder.

According to one of its harware-related aspects, the invention also relates to a telecommunication system including at least one transmitter provided with at least two transmitting antennas and at least one receiver provided with at least one receiving antenna, which transmitter includes symbol encoding means for producing symbols to be transmitted over communication channels established between the transmitting and receiving antennas,

system characterized in that said transmitter further includes symbol spreading means for spreading over several time chips a tunable integer number K of successive symbols before transmission of said symbols over said communication channels, said system further including tuning means for adjusting said tunable number K with respect to physical properties of the communication channels.

According to a possible embodiment of this harware-related aspect, the symbol spreading means are intended to compute a plurality of linear combinations of said K successive symbols, which linear combinations are intended to be transmitted by means of the transmitting antennas over a predetermined number of time chips.

According to a specific embodiment of the above-described harware-related aspect, the symbol spreading means are intended to multiply a vector formed by a concatenation of said K successive symbols, on the one hand, with a predefined spreading matrix, on the other hand.

According to another of its hardware-related aspects, the invention also relates to a communication device provided with at least two transmitting antennas and including symbol encoding means for producing symbols to be transmitted over said transmitting antennas, characterized in that it further includes symbol spreading means for spreading over several time chips a tunable integer number K of successive symbols before transmission of said symbols over said transmitting antennas.

The characteristics of the invention mentioned above, as well as others, will emerge more clearly from a reading of the following description given in relation to the accompanying figures, amongst which:

FIG. 1 is a block diagram showing a highly simplified MIMO telecommunication system;

FIG. 2 is a block diagram showing a space-time encoder included in a transmitter included in a MIMO telecommunication system according to a first embodiment of the invention;

FIG. 3 is a diagram showing how a spreading step according to the invention may be performed within such a space-time encoder;

FIG. 4 is a block diagram showing a space-time encoder included in a transmitter included in a MIMO telecommunication system according to a second embodiment of the invention;

FIG. 5 is a diagram showing how a spreading step according to the invention may be performed within such a space-time encoder;

FIG. 6 is a diagram showing a channel matrix associated with ergodic communication channels;

FIG. 7 is a diagram showing a spreading matrix adapted to such ergodic channels;

FIG. 8 is a diagram showing a channel matrix associated with block-fading communication channels;

FIG. 9 is a diagram showing a spreading matrix adapted to such block-fading channels; and

FIGS. 10 and 11 are diagrams showing how a spreading matrix adapted to block-fading communication channels may be constructed.

FIG. 1 diagrammatically shows a telecommunication system including at least one transmitter TR and one receiver REC, intended to exchange signals through multiple communication channels CHNL established between Nt transmitting and Nr receiving antennas (ta1, ta2 . . . taNt) and (ra1, ra2 . . . raNr), respectively.

The transmitter TR shown in the example depicted here includes a channel encoder CHENC intended to apply an encoding, e.g. by means of a convolutional code or of a turbo code, to uncoded data bits Uncb, and to provide a binary stream Tb to be transmitted. The transmitter TR includes an interleaver INTL intended to generate permutated bits Pb, such an interleaving being useful for a later processing on the receiver side, since it will allow to obtain uncorrelated data. The permutated bits Pb are then divided into words of at least one bit each, which words are then mapped, i.e. transformed into a series of coded symbols Zi by a mapping and modulation module MAPMD. Successive symbols Zi are then fed to symbol encoding means essentially formed by a space-time encoder SPTENC, which performs a processing of said symbols Zi before their transmission.

In the known state of the art, the components of each symbol Zi are usually intended to be transmitted during a same time chip by respective transmitting antennas.

The receiver REC shown in the example depicted here includes a space-time decoder SPTDEC intended to produce decoded data bits Decb which should ultimately correspond to the originally uncoded data bits Uncb. This space-time decoder SPTDEC includes a space-time detector DET intended to process data carried by signals received by means of the receiving antennas (ra1, ra2 . . . raNr), and to produce real or approximate likelihood values Rib related to estimates of the transmitted permutated bits Pb, which likelihood values are intended to be de-interleaved by a de-interleaver DINTL which is to output soft likelihood values Rb related to estimates of bits included in the binary stream Tb. A bit decoder included in the receiver REC, further referred to as channel decoder CHDEC, is intended to generate the decoded data bits Decb on the basis of said likelihood values Rb.

According to a loop structure commonly used in the art, the space-time detector DET will preferably make use of a priori information Pra generated in the course of previous decoding steps, and issued in the form of extrinsic information Exd by the channel decoder CHDEC through an interleaver INTR, which interleaver is identical to the interleaver INTL included in the transmitter TR.

The inventors have observed that increasing the diversity of the data perceived by the space-time detector DET enables said decoder to converge more quickly towards reliable estimates of the coded bits on the basis of which said data has been generated. The inventors have thus aimed at increasing the diversity of the data received by the receiving antennas (ra1, ra2 . . . raNr), by compounding the spatial diversity obtained by the use of multiple communication channels CHNL established between the transmitting and receiving antennas (ta1, ta2 . . . taNt) and (ra1, ra2 . . . raNr) with a diversity with respect to time of the data as perceived by receiving antennas at the receiver end of said channels.

To this end, in accordance with the invention, the space-time encoder SPTENC is to spread over several time chips a tunable integer number K of successive symbols Zi before transmitting said symbols over communication channels CHNL, said tunable number K being adjusted with respect to physical properties of the communication channels CHNL.

The choice, offered by virtue of the invention, of the value of the number K of successive symbols Zi whose components are to be spread over several time chips enables a tuning of the communication throughput between the transmitter TR and the receiver REC.

In this embodiment of the invention, the value of the tunable integer number K of successive symbols Zi whose components are to be spread over several time chips is to be adjusted dynamically by tuning means TUM included in the transmitter, on the basis of feedback information Fbi sent by the receiver REC and representative of the quality of communication conditions between said transmitter TR and receiver REC.

Such feedback information Fbi may be combined with locally available information within the transmitter TR. The feedback information may for example define a maximum data throughput value with respect to the communication conditions, whereas locally available information may indicate that an even lower data throughput would be sufficient for the ongoing communication, which could enable to save transmitting resources and power.

The feedback information Fbi may consist in a signal-to-noise ratio or in a signal-to-interference ratio computed in real time by the receiver REC, but it may also be formed by a maximum value of K computed by the receiver REC itself as a function of such signal-to-noise or signal-to-interference ratios, in which case the tuning means TUM may only be tasked with forwarding said value K to the space-time encoder SPTENC.

FIG. 2 diagrammatically shows a space-time encoder SPTENC according to a first embodiment of the invention. In the example depicted here, the space-time encoder SPTENC includes a series-to-parallel converter S/P intended to successively receive sets of K successive symbols Zi (for i=1 to K) and to deliver a vector formed by K concatenated successive symbols [Z1 . . . ZK] to symbol spreading means SPMD, said vector being intended to be multiplied by a spreading matrix SM within the symbol spreading means SPMD.

In the example depicted here, a difference between the size of the vector formed by a concatenation of said K successive symbols [Z1 . . . ZK], on the one hand, and a number of columns of the spreading matrix SM, on the other hand, enables to achieve data redundancy, the vector [Z1 . . . ZK] formed by a concatenation of said K successive symbols being completed with a number of nil components equal to said difference in order to perform the above described matrix multiplication, which results in a vector Z shown and described hereinafter.

The symbol spreading means SPMD are in turn intended to compute Ns=S.Nt linear combinations of the components Zi (for i=1 to K) of the symbol vector Z, said linear combinations being intended to be sequenced into a predetermined number S of successive sets of Nt components by sequencing means SQM before being transmitted by the Nt transmitting antennas (ta1, ta2 . . . taNt) over S time chips. The tunable number K may thus range from 1 to Ns.

The data transmitted at any given moment over the multiple communication channels established between said transmitting antennas (ta1, ta2 . . . taNt) and the above-described receiving antennas will thus not be representative of a single symbol Zi (for i=1 to K), as is usually the case in known MIMO systems, but will represent a mixture between K successive symbols, which thus introduces optimal data diversity as perceived at the receiver end, with respect to ongoing communication conditions.

FIG. 3 depicts how linear combinations of the symbols Zi (for i=1 to K) may be computed by the above-described spreading means. According to this first embodiment of the invention, a vector Z is formed by a concatenation of said K successive symbols Zi with a suitable number of nil components. This vector Z is then multiplied with a predefined spreading matrix SM having, in this example, a size of NsxNs, where Ns=S.Nt, which enables to produce Ns separate linear combinations of all components Zi (for i=1 to K) of the symbol vector Z, which linear combinations are to be transmitted over Nt transmitting antennas during S successive time chips, whith a redundancy which will be all the more important as the difference between K and Ns will be important.

FIG. 4 diagrammatically shows a space-time encoder SPTENC according to a second embodiment of the invention. In the example depicted here, the space-time encoder SPTENC includes a series-to-parallel converter S/P intended to successively receive sets of K successive symbols Zi (for i=1 to K) and to deliver a vector Z formed by K concatenated successive symbols [Z1 . . . ZK] to symbol spreading means SPMD, said vector Z being intended to be multiplied by a spreading matrix within the symbol spreading means SPMD.

In the example depicted here, a difference between the size of the vector Z formed by the concatenation of said K successive symbols [Z1 . . . ZK], on the one hand, and a number of columns of an original spreading matrix, on the other hand, enables to achieve data redundancy but requires that one dimension of the original spreading matrix be reduced to K by suppressing a number of colums or raws equal to said difference, which results in a reduced spreading matrix SMr able to perform the above described matrix multiplication, as shown and described hereinafter.

The symbol spreading means SPMD will thus compute Ns=S.Nt linear combinations of the components [Z1 . . . ZK] of the symbol vector Z, said linear combinations being intended to be sequenced into a predetermined number S of successive sets of Nt components by sequencing means SQM before being transmitted by the Nt transmitting antennas (ta1, ta2 . . . taNt) over S time chips. The tunable number K may thus range from 1 to Ns.

The data transmitted at any given moment over the multiple communication channels established between said transmitting antennas (ta1, ta2 . . . taNt) and the above-described receiving antennas will thus not be representative of a single symbol Zi (for i=1 to K), but will represent a mixture between K successive symbols [Z1 . . . ZK], which thus introduces optimal data diversity as perceived at the receiver end, with respect to ongoing communication conditions.

FIG. 5 depicts how linear combinations of the components [Z1 . . . ZK] of the symbol vector Z may be computed by the above-described spreading means. According to this second embodiment of the invention, the vector Z is formed by a concatenation of K successive symbols Zi. This vector Z is then multiplied with a reduced spreading matrix SMr having, in this example, a size of Ns rows and K columns, which enables to produce Ns=S.Nt separate linear combinations of all components Zi (for i=1 to K) of the symbol vector Z, which linear combinations are to be transmitted over Nt transmitting antennas during S successive time chips, with a redundancy which will be all the more important as the difference between K and Ns will be important.

Though, in this example, a whole block of size Nsx(Ns-K) has been discarded from an original spreading matrix SM of size NsxNs, it should be noted that, in variants of this second embodiment of the invention, the (Ns-K) columns to be discarded could be selected individually. Furthermore, in other variants of the invention, the vector Z could be transposed before being multiplied by the reduced matrix SMr, in which case said reduced matrix SMr would be obtained by discarding (Ns-K) rows, instead of (Ns-K) columns as described hereinbefore, from an original spreading matrix SM.

The nature of the above-mentioned predefined spreading matrixes SM may be chosen on the basis of prior knowledge of, or on the basis of assumptions pertaining to the communication channels to be established between the transmitting and receiving antennas.

FIG. 6 represents a channel matrix H depicting a situation in which the communication channels are supposed to be ergodic, i.e. the communication conditions within said channels are expected to change for each of the S time chips during which S successive sets of Nt linear combinations of the symbols Zi (for i=1 to K) are to be transmitted. This is modelized by S different diagonally arranged blocks H1 . . . Hs, each of which having a size of NrxNt.

The inventors have found that a high diversity will be obtained if the quantity of data carried by such ergodic communication channels is essentially homogeneous over time. This enables to prevent situations in which a high amount of data is present at a given instant at the output of said communication channels, following which given instant almost no data will be present at said output, which would mean that time-related information will be easily detectable at said given instant and barely detectable afterwards. An essentially homogeneous distribution over time of the energy carried by the symbols transmitted through ergodic communication channels ensures optimal detectability of changes in the communication conditions from one time chip to another, and thus enables to provide a high data diversity with respect to time and space as perceived by receiving antennas at the receiver end of such communication channels.

FIG. 7 depicts a spreading matrix SM according to a first variant of the above-described preferred embodiment of the invention, according to which said spreading matrix SM has a structure specifically adapted to ergodic communication channels. In this example, the spreading matrix SM is constructed in such a way that each of its rows RWk (for k=1 to Ns) is formed by S successive chunks Chk1 . . . Chks having each a size corresponding to the number Nt of transmitting antennas, all chunks of any given row forming respective vectors having all a same norm, which enables to obtain the above-described homogeneous distribution of energy carried by the symbols transmitted through ergodic communication channels.

In situations almost opposite to the ergodic case described above, the communication channels may be essentially invariant, i.e. the communication conditions within said channels are expected to remain the same for all of the S time chips during which S successive sets of Nt linear combinations of the symbols Zi (for i=1 to K) are to be transmitted.

In such a case, no diversity with respect to time will be induced by the communication channels, which may be modelized within the channel matrix H by S identical diagonally arranged blocks in place of the S different blocks H1 . . . Hs depicted in FIG. 6.

The inventors have found that a high time-related diversity as perceived by receiving antennas at the receiver end of such essentially invariant channels may be obtained by constructing the spreading matrix in such a way that each of its rows is formed by successive chunks having each a size corresponding to the number of transmitting antennas, all chunks of any given row forming respective vectors having all a same norm and being orthogonal to each other. A spreading matrix according to such a second variant of the above-described preferred embodiment of the invention may thus be represented as the matrix SM shown in FIG. 7, with the added condition that the chunks Chk1 . . . Chks of any given row RWk are orthogonal with respect to each other. Such an orthogonality enables to simulate the effect ergodic communication channels would have on transmitted sets of linear combinations of successive symbols, and thus may be construed as performing an artificial transformation of essentially invariant channels into ergodic channels during the time interval needed for transmitting all linear combinations of said successive symbols. As explained hereinbefore, the fact that all chunks Chk1 . . . Chks of any given row RWk have all a same norm enables to obtain a homogeneous distribution over time of the energy carried by the symbols transmitted through the artificially transformed communication channels.

A possible way of constructing such a spreading matrix consists in selecting, for each given row of this spreading matrix, a given square rotation matrix of dimensions NtxNt, with Nt greater than or equal to S, and selecting S rows of this rotation matrix for constituting the S successive chunks of said given row of the spreading matrix according to this second variant of the invention.

FIG. 8 represents a channel matrix H depicting a situation in which the communication channels are supposed to be so-called block-fading channels, which are expected to feature C successive sets of communication conditions over the S time chips during which S successive sets of Nt linear combinations of the symbols Zi (for i=1 to K) to be transmitted, each set of communication conditions of said block-fading channels being, however, essentially invariant during S/C successive time chips forming an invariance period.

The channel matrix H includes in such a case C different diagonally arranged blocks, each being constituted by S/C identical diagonally arranged sub-blocks, respectively H1 . . . Hc, having each a size of NrxNt.

FIG. 9 shows a third variant of the above-described preferred embodiment of the invention, according to which the spreading matrix SM is constructed in such a way that each of its rows RWk (for k=1 to Ns) is constituted by C segments Sgkn (for n=1 to C) forming respective vectors having all a same norm, each segment Sgkn including successive chunks Chkn,1 . . . Chkn,s/c having each a size corresponding to the number of transmitting antennas, all chunks Chkn,1 . . . Chkn,s/c of any given segment forming respective vectors having all a same norm and being orthogonal to each other.

The orthogonality between all chunks Chkn,1 . . . Chkn,s/c of a same segment Sgkn enables to add ergodicity to the block-fading channels during each invariance period defined by the corresponding S/C time chips, the equality of the norms of said chunks Chkn,1 . . . Chkn,s/c additionnally providing an essentially homogeneous distribution, over each relevant invariance period, of the energy carried by the symbols transmitted through the block-fading channels during said invariance period. Since the communication conditions within block-fading channels change from one invariance period to another, said channels may be considered ergodic at the scale of the invariance periods, so that the additional equality of the norms of the C segments Sgkn (for n=1 to C) of each row RWk (for k=1 to Ns) of the spreading matrix SM is sufficient to ensure an essentially homogeneous energy distribution over the S time chips during which S successive sets of Nt linear combinations of the symbols Zi (for i=1 to K) are to be transmitted. This in turn enables to provide a high diversity with respect to time and space of the data as perceived by receiving antennas at the receiver end of such block-fading communication channels.

FIGS. 10 and 11 illustrate how a spreading matrix SM according to this third variant of the above-described preferred embodiment of the invention may be constructed.

In a first stage shown in FIG. 10, C sub-matrices S(w) (for w=1 to C) are constructed by selecting a square cyclotomic rotation matrix CM of dimensions NtxNt, with Nt greater than or equal to S/C, and selecting S/C rows of matrix CM for constituting S/C successive diagonal chunks of length Nt intended to form a diagonal of each sub-matrix S(W), all such diagonal chunks thus having a same norm and being orthogonal to each other.

Each component CM_(m,1) of the cyclotomic matrix CM may be expressed as: ${{CM}_{m,l} = {\exp\left( {2{{j\pi} \cdot m \cdot \left( {\frac{1}{\Phi^{- 1}\left( {2 \cdot {Nt}} \right)} + \frac{l}{Nt}} \right)}} \right)}},$

where Φ represents an Euler function.

In a second stage shown in FIG. 11, the spreading matrix SM is then obtained by multiplying a matrix of dimension NsxNs formed by a diagonal array of such sub-matrices S(w) (for w=1 to C) with another cyclotomic rotation matrix B of dimensions NsxNs, whose components are given by: $B_{p,r} = {{\exp\left( {2{{j\pi} \cdot p \cdot \left( {\frac{1}{\Phi^{- 1}\left( {2 \cdot {Ns}} \right)} + \frac{r}{Ns}} \right)}} \right)}.}$

A spreading matrix SM constructed as explained above will additionnaly have the properties of a rotation matrix, i.e. such a spreading matrix will be constituted by rows orthogonal to each other and having a same norm, which may be expressed as SMxSM^(H)=I, where I is the identity matrix of rank NsxNs and SM^(H) is a transposed conjugate of matrix SM.

The use of a rotation matrix for computing a plurality of linear combinations of successive symbols at the transmitter end enables to optimize global performance of the iterative space-time decoder intended to process said symbols at the receiver end, by enhancing the performance of the first iterative step performed by said decoder.

This performance optimization is, of course, also of interest in a non-iterative space-time decoder, in which only a single decoding step is performed, which single decoding step is equivalent to the first iterative step mentioned above.

The choice, offered by virtue of the invention, of the value of the number K of successive symbols to be spread over several time chips enables to dynamically adjust the communication throughput between the transmitter and the receiver to communication conditions evaluated in real-time. 

1) A method for transmitting data in a telecommunication system including at least one transmitter provided with at least two transmitting antennas and at least one receiver provided with at least one receiving antenna, which method includes a symbol encoding step for producing symbols to be transmitted over communication channels established between the transmitting and receiving antennas, method characterized in that it further includes a symbol spreading step in the course of which a tunable integer number K of successive symbols are to be spread over several time chips before being transmitted over said communication channels, said tunable number K being adjusted with respect to physical properties of the communication channels. 2) A method as claimed in claim 1, characterized in that the tunable integer number K of successive symbols to be spread over several time chips is dynamically adjusted by the transmitter on the basis of feedback information sent by the receiver and representative of the quality of communication conditions between said transmitter and receiver. 3) A method as claimed in claims 1 or 2, characterized in that the symbol spreading step is performed by computing a plurality of linear combinations of said K successive symbols, which linear combinations are intended to be transmitted by means of the transmitting antennas over a predetermined number of time chips. 4) A method as claimed in claim 3, characterized in that the symbol spreading step is performed by multiplying a vector formed by a concatenation of said K successive symbols, on the one hand, with a predefined spreading matrix, on the other hand. 5) A method as claimed in claim 4, characterized in that, in case of a difference between the size of the vector formed by a concatenation of said K successive symbols, on the one hand, and a number of columns of the spreading matrix, on the other hand, the vector formed by a concatenation of said K successive symbols is completed with a number of nil components equal to said difference. 6) A method as claimed in claim 4, characterized in that, in case of a difference between the size of the vector formed by a concatenation of said K successive symbols, on the one hand, and a number of columns of the spreading matrix, on the other hand, one dimension of the spreading matrix is reduced by suppressing a number of colums or raws equal to said difference. 7) A method as claimed in any one of claims 4 to 6, characterized in that the spreading matrix is constructed in such a way that each of its rows is formed by successive chunks having each a size corresponding to the number of transmitting antennas, all chunks of any given row forming respective vectors having all a same norm. 8) A method as claimed in any one of claims 4 to 6, characterized in that the spreading matrix is constructed in such a way that each of its rows is formed by successive chunks having each a size corresponding to the number of transmitting antennas, all chunks of any given row forming respective vectors having all a same norm and being orthogonal to each other. 9) A method as claimed in any one of claims 4 to 6, characterized in that the spreading matrix is constructed in such a way that each of its rows is constituted by a plurality of segments forming respective vectors having all a same norm, each segment including successive chunks having each a size corresponding to the number of transmitting antennas, all chunks of any given segment forming respective vectors having all a same norm and being orthogonal to each other. 10) A method as claimed in claim 7, 8 or 9, characterized in that the spreading matrix is a rotation matrix. 11) A telecommunication system including at least one transmitter provided with at least two transmitting antennas and at least one receiver provided with at least one receiving antenna, which transmitter includes symbol encoding means for producing symbols to be transmitted over communication channels established between the transmitting and receiving antennas, system characterized in that said transmitter further includes symbol spreading means for spreading over several time chips a tunable integer number K of successive symbols before transmission of said symbols over said communication channels, said system further including tuning means for adjusting said tunable number K with respect to physical properties of the communication channels. 12) A telecommunication system as claimed in claim 11, characterized in that the symbol spreading means are intended to compute a plurality of linear combinations of K successive symbols, which linear combinations are intended to be transmitted by means of the transmitting antennas over a predetermined number of time chips. 13) A telecommunication system as claimed in claim 12, characterized in that the symbol spreading means are intended to multiply a vector formed by a concatenation of said K successive symbols, on the one hand, with a predefined spreading matrix, on the other hand. 14) A communication device provided with at least two transmitting antennas and including symbol encoding means for producing symbols to be transmitted over said transmitting antennas, characterized in that it further includes symbol spreading means for spreading over several time chips a tunable integer number K of successive symbols before transmission of said symbols over said transmitting antennas. 